A Global Optimization Algorithm for Space Trajectory Design
نویسنده
چکیده
Massimiliano Vasile European Space & Technology Centre ESA/ESTEC, SERA-A, Keplerlaan 1 2201 AZ Noordwijk, The Netherlands [email protected] Abstract In this paper a combination of Evolution Programming and Branching is used to solve a typical problem in space trajectory design: finding all possible minimum cost transfers, including the global one, between two celestial bodies. The idea is to use a limited population evolving for a small number of generations, according to some specific evolution rules, in subregions of the solution space defined by a branching procedure. On the other hand the branching rules are functions of the outcome from the local EP optimization. The proposed combined systematic-heuristic global optimization performs quite well on the analyzed cases suggesting the possibility of more complex application in space trajectory design.
منابع مشابه
OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملDesign space pruning heuristics and global optimization method for conceptual design of low-thrust asteroid tour missions
Electric propulsion has recently become a viable technology for spacecraft, enabling shorter flight times, fewer required planetary gravity assists, larger payload masses, and/or smaller launch vehicles. With the maturation of this technology, however, comes a new set of challenges in the area of trajectory design. In 2006, the 2 Global Trajectory Optimization Competition (GTOC2) posed a diffic...
متن کاملTrajectory Optimization of Cable Parallel Manipulators in Point-to-Point Motion
Planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. The problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. Open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...
متن کاملHybrid Teaching-Learning-Based Optimization and Harmony Search for Optimum Design of Space Trusses
The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...
متن کاملControl of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller
This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
متن کاملOptimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004